Jacobson's Lemma revisited

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Farkas Lemma Revisited

The Farkas Lemma is extended to simultaneous linear operator and polyhedral sublinear operator inequalities by Boolean valued analysis. Introduction The Farkas Lemma, also known as the Farkas–Minkowski Lemma, plays a key role in linear programming and the relevant areas of optimization (cp. [1]). Some rather simple proof of the lemma is given in [2]. Using the technique of Boolean valued analys...

متن کامل

Leftover Hash Lemma, Revisited

The famous Leftover Hash Lemma (LHL) states that (almost) universal hash functions are good randomness extractors. Despite its numerous applications, LHL-based extractors suffer from the following two limitations: – Large Entropy Loss: to extract v bits from distribution X of minentropy m which are ε-close to uniform, one must set v ≤ m − 2 log (1/ε), meaning that the entropy loss L def = m − v...

متن کامل

Szemerédi's regularity lemma revisited

Szemerédi’s regularity lemma is a basic tool in graph theory, and also plays an important role in additive combinatorics, most notably in proving Szemerédi’s theorem on arithmetic progressions [19], [18]. In this note we revisit this lemma from the perspective of probability theory and information theory instead of graph theory, and observe a slightly stronger variant of this lemma, related to ...

متن کامل

The stable regularity lemma revisited

We prove a regularity lemma with respect to arbitrary Keisler measures μ on V , ν on W where the bipartite graph (V,W,R) is definable in a saturated structure M̄ and the formula R(x, y) is stable. The proof is rather quick, making use of local stability theory. The special case where (V,W,R) is pseudofinite, μ, ν are the counting measures, and M̄ is suitably chosen (for example a nonstandard mode...

متن کامل

The New Periodicity Lemma revisited

Some years ago a New Periodicity Lemma (NPL) was published, showing that the occurrence of two squares at any position i in a string necessarily precludes the occurrence of other squares of specified period in a specified neighbourhood of i. The proof of this lemma was complex, breaking down into 14 subcases, and required that the shorter of the two squares be regular. In this paper we signific...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Algebra

سال: 1980

ISSN: 0021-8693

DOI: 10.1016/0021-8693(80)90196-9